More on the pressing down game

نویسندگان

  • Jakob Kellner
  • Saharon Shelah
چکیده

We investigate the pressing down game and its relation to the Banach Mazur game. In particular we show: Consistently relative to a supercompact, there is a nowhere precipitous normal ideal I on א2 such that player nonempty wins the pressing down game of length א1 on I even if player empty starts. For the proof, we construct a forcing notion to force the following: There is normal, nowhere precipitous ideal I on a supercompact κ such that for every I-positive A there is a normal ultrafilter containing A and extending the dual of I. We investigate the pressing down game and its relation to the Banach Mazur game. Definitions (and some well known or obvious properties) are given in Section 1. The results are summarized in Section 2. This paper continues (and simplifies, see 2.2) the investigation of Pauna and the authors in [14]. 1. Definitions sec:def We use the following notation: • For forcing conditions q ≤ p, the smaller condition q is the stronger one. We stick to Goldstern’s alphabetic convention and use lexicographically bigger symbols for stronger conditions. • E λ = {α ∈ κ : cf(α) = λ}. • NSκ is the nonstationary ideal on κ. • The dual of an ideal I is the filter {A ⊆ κ : κ \A ∈ I} and vice versa. • For an ideal I on κ and a positive set A (i.e., A / ∈ I), we set I ↾ A to be the ideal generated by I ∪ {κ \A}. We always assume that κ is a regular uncountable cardinal and that I is a <κcomplete ideal on κ. Unless noted otherwise, we will also assume that I is normal. We now recall the definitions of several games of length ω, played by the players empty and nonempty. We abbreviate “having a winning strategy for G” with “winning G” (as opposed to: “winning a specific run of G”). We now define four variants of the pressing down game (this game has been used, e.g., in [16]). Definition 1.1. • PD(I) is played as follows: Set S−1 = κ. At stage n, empty chooses a regressive function fn : κ → κ, and nonempty chooses Sn, an fn-homogeneous subset of Sn−1. Empty wins the run of the game if

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winning the pressing down game but not Banach-Mazur

Let S be the set of those α ∈ ω2 that have cofinality ω1. It is consistent relative to a measurable that the nonempty player wins the pressing down game of length ω1, but not the Banach Mazur game of length ω+1 (both games starting with S).

متن کامل

The Effectiveness of Game Therapy on Social Skills, Anxiety, and Aggression in Down syndrome Children

The aim of this study was to evaluate the effectiveness of therapeutic games on social skills, anxiety and aggression in children with Down syndrome. This is a quasi-experimental study with pre-test and post-test design with control group. The statistical population of the study included all children with Down syndrome under the protection of Kermanshah Welfare Organization in 2018. A total of ...

متن کامل

The effect of bottom-up and top-down auditory program training on the development of children's auditory processing skills

Although there have been several previous investigations on the role of auditory training for the development of auditory processing skills, it still remains unknown whether children with auditory processing difficulties can get improved auditory skills after exposure to a multi-modal training experience comprising both visual and tactile stimuli. The present study, therefore, attempted to use ...

متن کامل

The effect of bottom-up and top-down auditory program training on the development of children's auditory processing skills

Although there have been several previous investigations on the role of auditory training for the development of auditory processing skills, it still remains unknown whether children with auditory processing difficulties can get improved auditory skills after exposure to a multi-modal training experience comprising both visual and tactile stimuli. The present study, therefore, attempted to use ...

متن کامل

Proving the Pressing Game Conjecture on Linear Graphs

The pressing game on black-and-white graphs is the following: Given a graph G(V,E) with its vertices colored with black and white, any black vertex v can be pressed, which has the following effect: (a) all neighbors of v change color, i.e. white neighbors become black and vice versa, (b) all pairs of neighbors of v change connectivity, i.e. connected pairs become unconnected, unconnected ones b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Arch. Math. Log.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 2011